cody - HTMLify profile
files of /cody/pratham0709/Striver-A-TO-Z-SDE-SHEET/Binary Search/BS on 1D Arrays/
(Leetcode) Find First and Last Position of Element in Sorted Array.cpp
/cody/pratham0709/Striver-A-TO-Z-SDE-SHEET/Binary Search/BS on 1D Arrays/(Leetcode) Find First and Last Position of Element in Sorted Array.cpp
class Solution {
public:
vector<int> searchRange(vector<int>& nums, int target) {
int n = nums.size();
public:
vector<int> searchRange(vector<int>& nums, int target) {
int n = nums.size();
Binary search.cpp
/cody/pratham0709/Striver-A-TO-Z-SDE-SHEET/Binary Search/BS on 1D Arrays/Binary search.cpp
class Solution {
public:
int search(vector<int>& nums, int target) {
int n = nums.size();
int start = 0;
public:
int search(vector<int>& nums, int target) {
int n = nums.size();
int start = 0;
Find Minimum in Rotated Sorted Array.cpp
/cody/pratham0709/Striver-A-TO-Z-SDE-SHEET/Binary Search/BS on 1D Arrays/Find Minimum in Rotated Sorted Array.cpp
class Solution {
public:
int findMin(vector<int>& nums) {
int n = nums.size();
int start = 0;
int en
public:
int findMin(vector<int>& nums) {
int n = nums.size();
int start = 0;
int en
Find Peak Elements.cpp
/cody/pratham0709/Striver-A-TO-Z-SDE-SHEET/Binary Search/BS on 1D Arrays/Find Peak Elements.cpp
class Solution {
public:
int findPeakElement(vector<int>& arr) {
int n =arr.size();
if(n == 1) return 0;
if(arr[
public:
int findPeakElement(vector<int>& arr) {
int n =arr.size();
if(n == 1) return 0;
if(arr[
First and Last Position of an Element In Sorted Array(CN).cpp
/cody/pratham0709/Striver-A-TO-Z-SDE-SHEET/Binary Search/BS on 1D Arrays/First and Last Position of an Element In Sorted Array(CN).cpp
#include <bits/stdc++.h>
int firstOcc(vector<int>& arr, int n, int k){
int start = 0;
int end = n-1;
in
int firstOcc(vector<int>& arr, int n, int k){
int start = 0;
int end = n-1;
in
Implement Lower Bound.cpp
/cody/pratham0709/Striver-A-TO-Z-SDE-SHEET/Binary Search/BS on 1D Arrays/Implement Lower Bound.cpp
int lowerBound(vector<int> arr, int n, int x) {
int start = 0;
int end = n-1;
int mid = start +(end - start) /2;
int
int start = 0;
int end = n-1;
int mid = start +(end - start) /2;
int
Implement Upper Bound.cpp
/cody/pratham0709/Striver-A-TO-Z-SDE-SHEET/Binary Search/BS on 1D Arrays/Implement Upper Bound.cpp
int upperBound(vector<int> &arr, int x, int n){
// Write your code here.
int start = 0;
int end = n-1;
int mid = start
// Write your code here.
int start = 0;
int end = n-1;
int mid = start
Search In Rotated Sorted Array.cpp
/cody/pratham0709/Striver-A-TO-Z-SDE-SHEET/Binary Search/BS on 1D Arrays/Search In Rotated Sorted Array.cpp
int search(vector<int>& arr, int n, int k)
{
// Write your code here.
// Return the position of K in ARR else return
{
// Write your code here.
// Return the position of K in ARR else return
Search Insert Position.cpp
/cody/pratham0709/Striver-A-TO-Z-SDE-SHEET/Binary Search/BS on 1D Arrays/Search Insert Position.cpp
int searchInsert(vector<int>& arr, int m)
{
// Write your code here.
int n = arr.size();
int start = 0;
int end = n-1;
{
// Write your code here.
int n = arr.size();
int start = 0;
int end = n-1;
Search in Rotated Sorted Array II.cpp
/cody/pratham0709/Striver-A-TO-Z-SDE-SHEET/Binary Search/BS on 1D Arrays/Search in Rotated Sorted Array II.cpp
class Solution {
public:
bool search(vector<int>& nums, int target) {
int start = 0;
int end = nums.size()-1;
w
public:
bool search(vector<int>& nums, int target) {
int start = 0;
int end = nums.size()-1;
w
Single Elements in Sorted Array.cpp
/cody/pratham0709/Striver-A-TO-Z-SDE-SHEET/Binary Search/BS on 1D Arrays/Single Elements in Sorted Array.cpp
class Solution {
public:
int singleNonDuplicate(vector<int>& nums) {
int n = nums.size();
if(n == 1) return nums[0];
if(nu
public:
int singleNonDuplicate(vector<int>& nums) {
int n = nums.size();
if(n == 1) return nums[0];
if(nu